Subdivision Direction Selection in Interval Methods for Global Optimization
نویسندگان
چکیده
منابع مشابه
A Review of Subdivision Direction Selection in Interval Methods for Global Optimization
A review of subdivision direction selection in interval methods for global optimization This paper gives a short overview of the latest results on the role of the interval subdivision selection rule in branch-and-bound algorithms for global optimization. The class of rules that allow convergence for two slightly diierent model algorithms is characterized, and it is shown that the four rules inv...
متن کاملNew interval methods for constrained global optimization
Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. ...
متن کاملComparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods
We compare six state-of-the-art local optimization solvers with focus on their efficiency when invoked within an interval-based global optimization algorithm. For comparison purposes we design three special performance indicators: a solution check indicator (measuring whether the local minimizers found are good candidates for near-optimal verified feasible points), a function value indicator (m...
متن کاملAlternating Direction Methods for Sparse Covariance Selection
The mathematical model of the widely-used sparse covariance selection problem (SCSP) is an NP-hard combinatorial problem, whereas it can be well approximately by a convex relaxation problem whose maximum likelihood estimation is penalized by the L1 norm. This convex relaxation problem, however, is still numerically challenging, especially for large-scale cases. Recently, some efficient first-or...
متن کاملEfficient interval partitioning for constrained global optimization
1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1997
ISSN: 0036-1429,1095-7170
DOI: 10.1137/s0036142995281528